A counterexample to the dominating set conjecture
نویسندگان
چکیده
The metric polytope metn is the polyhedron associated with all semimetrics on n nodes and defined by the triangle inequalities xij − xik − xjk ≤ 0 and xij + xik + xjk ≤ 2 for all triples i, j, k of {1, . . . , n}. In 1992 Monique Laurent and Svatopluk Poljak conjectured that every fractional vertex of the metric polytope is adjacent to some integral vertex. The conjecture holds for n ≤ 8 and, in particular, for the 1 550 825 600 vertices of met8. While the overwhelming majority of the known vertices of met9 satisfy the conjecture, we exhibit a fractional vertex not adjacent to any integral vertex.
منابع مشابه
On the oriented perfect path double cover conjecture
An oriented perfect path double cover (OPPDC) of a graph $G$ is a collection of directed paths in the symmetric orientation $G_s$ of $G$ such that each arc of $G_s$ lies in exactly one of the paths and each vertex of $G$ appears just once as a beginning and just once as an end of a path. Maxov{'a} and Ne{v{s}}et{v{r}}il (Discrete Math. 276 (2004) 287-294) conjectured that ...
متن کاملCounterexample to a Conjecture on the Structure of Bipartite Partitionable Graphs
A graph G is called a prism fixer if γ(G×K2) = γ(G), where γ(G) denotes the domination number of G. A symmetric γ-set of G is a minimum dominating set D which admits a partition D = D1 ∪ D2 such that V (G)−N [Di] = Dj , i, j = 1, 2, i 6= j. It is known that G is a prism fixer if and only if G has a symmetric γ-set. Hartnell and Rall [On dominating the Cartesian product of a graph and K2, Discus...
متن کاملVizing's conjecture: a survey and recent results
Vizing’s conjecture from 1968 asserts that the domination number of the Cartesian product of two graphs is at least as large as the product of their domination numbers. In this paper we survey the approaches to this central conjecture from domination theory and give some new results along the way. For instance, several new properties of a minimal counterexample to the conjecture are obtained an...
متن کامل4, 5 Is Not Coverable: A Counterexample to a Conjecture of Kaiser and Škrekovski
For a subset A of the set of positive integers, a graph G is called A-coverable if G has a cycle (a subgraph in which all vertices have even degree) which intersects all edge-cuts T in G with |T | ∈ A, and A is said to be coverable if all graphs are A-coverable. As a possible approach to the Dominating cycle conjecture, Kaiser and Škrekovski conjectured in [Cycles intersecting edge-cuts of pres...
متن کامل{ 4 , 5 } is not coverable – a counterexample to Kaiser - Škrekovski conjecture
For a subset A of the set of positive integers, a graph G is called A-coverable if G has a cycle (a subgraph in which all vertex has even degree) which intersects all edge-cuts T in G with |T | ∈ A, and A is said to be coverable if all graph is A-coverable. As a possible approach to Dominating cycle conjecture, in [Cycles intersecting edge-cuts of prescribed sizes, SIAM J. Discrete Math. 22 (20...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Optimization Letters
دوره 1 شماره
صفحات -
تاریخ انتشار 2007